Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory
نویسندگان
چکیده
منابع مشابه
Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory
Article history: Received 29 February 2016 Received in revised form 27 June 2016 Accepted 25 July 2016 Available online 12 August 2016
متن کاملHuge tables are fixed parameter tractable via unimodular integer Caratheodory
The three-way table problem is to decide if there exists an l × m × n table satisfying given line sums, and find a table if yes. Recently, it was shown to be fixed-parameter tractable with parameters l, m. Here we extend this and show that the huge version of the problem, where the variable side n is encoded in binary, is also fixed-parameter tractable with parameters l, m. We also conclude tha...
متن کاملInteger Multicommodity Flows with Reduced
Given a supply graph G = (V; E), a demand graph H = (T; D), edge capacities c : E 7 ! II N and requests r : D 7 ! II N, we consider the problem of nding integer multiiows subject to c; r. Korach and Penn constructed approximate integer multiiows for planar graphs, but no results were known for the general case. Via derandomization we present a polynomial-time approximation algorithm. There are ...
متن کاملInteger Multicommodity Flows with Reduced Demands Integer Multicommodity Flows with Reduced Demands
Given a supply graph G = (V; E), a demand graph H = (T; D), edge capacities c : E 7 ! II N and requests r : D 7 ! II N, we consider the problem of nding integer multiiows subject to c; r. Korach and Penn constructed approximate integer multiiows for planar graphs, but no results were known for the general case. Via derandomization we present a polynomial-time approximation algorithm. There are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2017
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2016.07.004